Bounds of the longest directed cycle length for minimal strong digraphs
نویسندگان
چکیده
منابع مشابه
Minimal strong digraphs
We introduce adequate concepts of expansion of a digraph to obtain a sequential construction of minimal strong digraphs. We obtain a characterization of the class of minimal strong digraphs whose expansion preserves the property of minimality. We prove that every minimal strong digraph of order n > 2 is the expansion of a minimal strong digraph of order n — \ and we give sequentially generative...
متن کاملThe ratio of the longest cycle and longest path in semicomplete multipartite digraphs
A digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair of mutually opposite arcs is called a semicomplete n-partite digraph. We call (D)=max16 i6 n{|Vi|} the independence number of the semicomplete n-partite digraph D, where V1; V2; : : : ; Vn are the partite sets of D. Let p and c, respectively, denote the number of vertices in a longest directed path and t...
متن کاملStrong exponent bounds for the local Rankin-Selberg convolution
Let $F$ be a non-Archimedean locally compact field. Let $sigma$ and $tau$ be finite-dimensional representations of the Weil-Deligne group of $F$. We give strong upper and lower bounds for the Artin and Swan exponents of $sigmaotimestau$ in terms of those of $sigma$ and $tau$. We give a different lower bound in terms of $sigmaotimeschecksigma$ and $tauotimeschecktau$. Using the Langlands...
متن کاملLongest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a semicomplete multipartite digraph. L. Volkmann (1998) raised the following question: Let D be a strong semicomplete multipartite digraph with a longest path of length l. Does there exist a strong spanning oriented subgraph of D with a lo...
متن کاملNew length bounds for cycle bases
Based on a recent work by Abraham, Bartal and Neiman (2007), we construct a strictly fundamental cycle basis of length O(n) for any unweighted graph, whence proving the conjecture of Deo et al. (1982). For weighted graphs, we construct cycle bases of length O(W ·logn log logn), where W denotes the sum of the weights of the edges. This improves the upper bound that follows from the result of Elk...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1988
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90037-4